Rough Sets Inspired Extension of Forward Inference Algorithm
نویسندگان
چکیده
The main goal of this work is to introduce theoretical background of the extended forward inference algorithm. Proposed algorithm allow to continue inference after its failure. Inference failure means that the inference engine is unable to obtain the solutions — the new facts or goals confirmation. Two-phase extension of classical inference algorithm is considered. In the first phase, classical forward inference is executed. If inference fails, second phase is activated and targeted search for additional facts is executed in the interactive mode. Inference extension proposed in this work is inspired be the rough sets theory which provides the conception of lower and upper approximations of particular sets.
منابع مشابه
Exploration of Knowledge Bases Inspired by Rough Set Theory
In this paper, we discuss some issues related to exploration of knowledge bases inspired by the rough set theory, which emerged 30 years ago, and is nowadays a rapidly developing branch of artificial intelligence. The partition of rules approach allows us to divide a large set of rules into smaller subsets that are easier to manage. Optimisation relies on reducing the number of rules searched i...
متن کاملA hybrid filter-based feature selection method via hesitant fuzzy and rough sets concepts
High dimensional microarray datasets are difficult to classify since they have many features with small number ofinstances and imbalanced distribution of classes. This paper proposes a filter-based feature selection method to improvethe classification performance of microarray datasets by selecting the significant features. Combining the concepts ofrough sets, weighted rough set, fuzzy rough se...
متن کاملAn Efficient Algorithm for Inference in Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. No study, however, has yet investigated the complexity of the accompanying inference algorithm, nor the complexity of inference in RSFGs. In this paper, we show that the traditional RSFG inference algorithm has exponential time complexity. We then propose a new RSFG inference algorithm tha...
متن کاملSoft Interval –Valued Neutrosophic Rough Sets
In this paper, we first defined soft intervalvalued neutrosophic rough sets(SIVNrough sets for short) which combines interval valued neutrosophic soft set and rough sets and studied some of its basic properties. This concept is an extension of soft interval valued intuitionistic fuzzy rough sets( SIVIFrough sets). Finally an illustartive example is given to verfy the developped algorithm and to...
متن کاملIncremental updating approximations in probabilistic rough sets under the variation of attributes
The attribute set in an information system evolves in time when new information arrives. Both lower and upper approximations of a concept will change dynamically when attributes vary. Inspired by the former incremental algorithm in Pawlak rough sets, this paper focuses on new strategies of dynamically updating approximations in probabilistic rough sets and investigates four propositions of upda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015